Cutoff for the averaging process on the hypercube and complete bipartite graphs
نویسندگان
چکیده
We consider the averaging process on a graph, that is evolution of mass distribution undergoing repeated averages along edges graph at arrival times independent Poisson processes. establish cutoff phenomena for both L1 and L2 distance from stationarity when discrete hypercube complete bipartite. Some general facts about arbitrary graphs are also discussed.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولOn the cyclic decomposition of complete graphs into bipartite graphs
Let G be a graph with n edges. It is known that there exists a cyelic Gdecomposition of K 2n+1 if and only if G has a p-Iabeling. An a-labeling of G easily yields both a cyelic G-decomposition of Kn,n and of K2nx+l for all positive integers x. It is well-known that certain classes of bipartite graphs (including certain trees) do not have a-Iabelings. :Moreover, there are bipartite graphs with n...
متن کاملMonotonicity for Complete Graphs and Symmetric Complete Bipartite Graphs
Given a graph G, let fk be the number of forests of cardinality k in G. Then the sequence (fk) has been conjectured to be unimodal for any graph G. In this paper we confirm this conjecture for Kn and Kn,n by showing that the sequence for Kn is strictly increasing (when n ≥ 4) and the sequence for Kn,n is strictly increasing except for the very last term. As a corollary we also confirm the conje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2023
ISSN: ['1083-6489']
DOI: https://doi.org/10.1214/23-ejp993